Decomposing a Multigraph into Split Components
نویسنده
چکیده
A linear-time algorithm for decomposing a graph into split components is presented. The algorithm uses a new graph transformation technique to gradually transform the given graph so that every split component in it is transformed into a subgraph with very simple structure which can be easily identified. Once the split components are determined, the triconnected components of the graph are easily determined. The algorithm is conceptually simple and makes one less pass over the input graph than the existing best known algorithm which could mean substantial saving in actual execution time. The new graph transformation technique may be useful in other context.
منابع مشابه
Decomposing Semi-complete Multigraphs and Directed Graphs into Paths of Length Two
A P3-decomposition of a graph is a partition of the edges of the graph into paths of length two. We give a necessary and sufficient condition for a semi-complete multigraph, that is a multigraph with at least one edge between each pair of vertices, to have a P3-decomposition. We show that this condition can be tested in strongly polynomial-time, and that the same condition applies to a larger c...
متن کاملFads Models with Markov Switching Hetroskedasticity: decomposing Tehran Stock Exchange return into Permanent and Transitory Components
Stochastic behavior of stock returns is very important for investors and policy makers in the stock market. In this paper, the stochastic behavior of the return index of Tehran Stock Exchange (TEDPIX) is examined using unobserved component Markov switching model (UC-MS) for the 3/27/2010 until 8/3/2015 period. In this model, stock returns are decomposed into two components; a permanent componen...
متن کاملNeuropsychological Decomposing Stroop Interference Into Different Cognitive Monitoring; An Exploratory Factor Analysis
Introduction: There are two alternative explanations of the Stroop phenomenon. Several studies have revealed that the difference in performance on congruent and incongruent trials can arise from response interference. On the contrary, many authors have claimed that Stroop interference might occur at earlier processing stages related to semantic or conceptual encoding. The present study aims to ...
متن کاملModel-Integrated Program Synthesis Environment
The paper describes a model-integrated program synthesis environment for computer-based system applications. In Model-Integrated Program Synthesis (MIPS), domain-specific, multiple-view models represent the software, its environment and their relationships. Model interpreters translate the models into the input languages of static and dynamic analysis tools, and application specific model inter...
متن کاملDecomposing Boolean formulas into connected components
The aim of this contribution is to find a way how to improve efficiency of current state-of-the-art satisfiability solvers. The idea is to split a given instance of the problem into parts (connected components) which can be solved separately. For this purpose we define component trees and a related problem of finding optimal component trees. We describe how this approach can be combined with st...
متن کامل